A complex-variables proof of Hölder’s inequality
نویسندگان
چکیده
منابع مشابه
A Computer Proof of Turán’s Inequality
We show how Turán’s inequality Pn(x) −Pn−1(x)Pn+1(x) ≥ 0 for Legendre polynomials and related inequalities can be proven by means of a computer procedure. The use of this procedure simplifies the daily work with inequalities. For instance, we have found the stronger inequality |x|Pn(x) 2 − Pn−1(x)Pn+1(x) ≥ 0, −1 ≤ x ≤ 1, effortlessly with the aid of our method.
متن کاملA New Proof Method of Analytic Inequality
This paper gives a new proof method of analytic inequality involving n variables. As its Applications, we proved some well-known inequalities and improved the Carleman-Inequality. 1. monotonicity on special region Throughout the paper R denotes the set of real numbers and R+ denotes the set of strictly positive real numbers, n ∈ N, n ≥ 2. In this section, we shall provide a new proof method of ...
متن کاملA simple proof of Bell's inequality
Bell's theorem is a fundamental result in quantum mechanics: it discriminates between quantum mechanics and all theories where probabilities in measurement results arise from the ignorance of pre-existing local properties. We give an extremely simple proof of Bell's inequality; a single figure suffices. This simplicity may be useful in the unending debate over what exactly the Bell inequality m...
متن کاملA short proof of Paouris’ inequality
We give a short proof of a result of G. Paouris on the tail behaviour of the Euclidean norm |X| of an isotropic log-concave random vector X ∈ R, stating that for every t ≥ 1, P ` |X| ≥ ct √ n ́ ≤ exp(−t √ n). More precisely we show that for any log-concave random vector X and any p ≥ 1, (E|X|) ∼ E|X|+ sup z∈Sn−1 (E|〈z, X〉|). AMS Classification: 46B06, 46B09 (Primary), 52A23 (Secondary)
متن کاملA probabilistic proof for the lym-inequality
Here we give a short, inductive argument yielding (1). First note that (1) is evident if n = 1, and also if X E S (in the latter case necessarily 9 -= 1.x) holds). Now assume (1) is true for n 1, !F is an antichain and X 4 9. Let x be a random variable which takes the values 1,. . . , n; each with probability l/n. Let us define s(x) = {FE ZF: x9! fl. For any function g(x), we denote by E(g(x)) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1964
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1964-0174682-4